Parameter Free Induction and Reeection

نویسنده

  • Lev D. Beklemishev
چکیده

We give a precise characterization of parameter free n and n induction schemata, I ? n and I ? n , in terms of reeection principles. This allows us to show that I ? n+1 is conservative over I ? n w.r.t. boolean combinations of n+1 sentences, for n 1. In particular, we give a positive answer to a question by R. Kaye, whether the provably recursive functions of I ? 2 are exactly the primitive recursive ones. We also obtain sharp results on the strength of bounded number of instances of parameter free induction in terms of iterated reeection.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Induction Rules, Reeection Principles, and Provably Recursive Functions

A well-known result of D. Leivant states that, over basic Kalmar elementary arithmetic EA, the induction schema for n formulas is equivalent to the uniform reeection principle for n+1 formulas. We show that fragments of arithmetic axiomatized by various forms of induction rules admit a precise axiomatization in terms of reeection principles as well. Thus, the closure of EA under the induction r...

متن کامل

Robust Backstepping Control of Induction Motor Drives Using Artificial Neural Networks and Sliding Mode Flux Observers

In this paper, using the three-phase induction motor fifth order model in a stationary twoaxis reference frame with stator current and rotor flux as state variables, a conventional backsteppingcontroller is first designed for speed and rotor flux control of an induction motor drive. Then in orderto make the control system stable and robust against all electromechanical parameter uncertainties a...

متن کامل

Hecke Algebra Solutions to the Reflection Equation

We construct solutions to Sklyanin's reeection equation in the case in which the bulk Yang-Baxter solution is of Hecke algebra type. Each solution constitutes an extension of the Hecke algebra together with a spectral parameter dependent boundary operator, K(). We solve for the deening relations of the extension, and for the spectral parameter dependence of the boundary operator. Finding concre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996